Computational geometry for the gourmet old fare and new dishes
Identifieur interne : 001247 ( Main/Exploration ); précédent : 001246; suivant : 001248Computational geometry for the gourmet old fare and new dishes
Auteurs : Bernard Chazelle [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1991.
English descriptors
- Teeft :
- Algorithm, Binary searches, Chazelle, Clarkson, Comp, Comput, Computational, Computational geometry, Computer graphics, Computer science, Convex, Convex hull, Convex hulls, Current understanding, Data structures, Dynamic point location, Efficient solutions, Fractional, Geom, Ieee, Ieee symp, Ieee syrup, Line segments, Linear programming, Linear time, Lower bounds, Maximum size, Open problem, Optimal algorithm, Orlhogonal range, Planar, Planar partition algorithm, Planar subdivision, Point location, Polygon, Polygonal curves, Preparata, Proc, Proe, Query, Random permutation, Random sampling, Regular cell, Restrictive assumption, Seidel, Sharir, Simple polygon, Stratification scheme, Surface removal, Symbolic comput, Symp, Triangulating, Visible scene.
Abstract
Abstract: It is time to bring this quick overview to a close. There are many interesting problems that I have not touched upon here but which deserve intense scrutiny nevertheless. Some concern important combinatorial issues in discrete geometry, such as zone theorems, and the maximum size of k-sets. Others address the practical aspects of implementing and debugging geometric algorithms, and in particular, robustness in the face of round-off errors.
Url:
DOI: 10.1007/3-540-54233-7_174
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001217
- to stream Istex, to step Curation: 001130
- to stream Istex, to step Checkpoint: 001020
- to stream Main, to step Merge: 001251
- to stream Main, to step Curation: 001247
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Computational geometry for the gourmet old fare and new dishes</title><author><name sortKey="Chazelle, Bernard" sort="Chazelle, Bernard" uniqKey="Chazelle B" first="Bernard" last="Chazelle">Bernard Chazelle</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:AD5287C06ABB2C114BCE963E9CA597D2F49A463F</idno><date when="1991" year="1991">1991</date><idno type="doi">10.1007/3-540-54233-7_174</idno><idno type="url">https://api.istex.fr/document/AD5287C06ABB2C114BCE963E9CA597D2F49A463F/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001217</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001217</idno><idno type="wicri:Area/Istex/Curation">001130</idno><idno type="wicri:Area/Istex/Checkpoint">001020</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001020</idno><idno type="wicri:doubleKey">0302-9743:1991:Chazelle B:computational:geometry:for</idno><idno type="wicri:Area/Main/Merge">001251</idno><idno type="wicri:Area/Main/Curation">001247</idno><idno type="wicri:Area/Main/Exploration">001247</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Computational geometry for the gourmet old fare and new dishes</title><author><name sortKey="Chazelle, Bernard" sort="Chazelle, Bernard" uniqKey="Chazelle B" first="Bernard" last="Chazelle">Bernard Chazelle</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">New Jersey</region></placeName><wicri:cityArea>Department of Computer Science, Princeton University, 08544, Princeton</wicri:cityArea></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1991</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Algorithm</term><term>Binary searches</term><term>Chazelle</term><term>Clarkson</term><term>Comp</term><term>Comput</term><term>Computational</term><term>Computational geometry</term><term>Computer graphics</term><term>Computer science</term><term>Convex</term><term>Convex hull</term><term>Convex hulls</term><term>Current understanding</term><term>Data structures</term><term>Dynamic point location</term><term>Efficient solutions</term><term>Fractional</term><term>Geom</term><term>Ieee</term><term>Ieee symp</term><term>Ieee syrup</term><term>Line segments</term><term>Linear programming</term><term>Linear time</term><term>Lower bounds</term><term>Maximum size</term><term>Open problem</term><term>Optimal algorithm</term><term>Orlhogonal range</term><term>Planar</term><term>Planar partition algorithm</term><term>Planar subdivision</term><term>Point location</term><term>Polygon</term><term>Polygonal curves</term><term>Preparata</term><term>Proc</term><term>Proe</term><term>Query</term><term>Random permutation</term><term>Random sampling</term><term>Regular cell</term><term>Restrictive assumption</term><term>Seidel</term><term>Sharir</term><term>Simple polygon</term><term>Stratification scheme</term><term>Surface removal</term><term>Symbolic comput</term><term>Symp</term><term>Triangulating</term><term>Visible scene</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: It is time to bring this quick overview to a close. There are many interesting problems that I have not touched upon here but which deserve intense scrutiny nevertheless. Some concern important combinatorial issues in discrete geometry, such as zone theorems, and the maximum size of k-sets. Others address the practical aspects of implementing and debugging geometric algorithms, and in particular, robustness in the face of round-off errors.</div></front></TEI><affiliations><list><country><li>États-Unis</li></country><region><li>New Jersey</li></region></list><tree><country name="États-Unis"><region name="New Jersey"><name sortKey="Chazelle, Bernard" sort="Chazelle, Bernard" uniqKey="Chazelle B" first="Bernard" last="Chazelle">Bernard Chazelle</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001247 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001247 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Sarre
|area= MusicSarreV3
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:AD5287C06ABB2C114BCE963E9CA597D2F49A463F
|texte= Computational geometry for the gourmet old fare and new dishes
}}
| This area was generated with Dilib version V0.6.33. |  |